Restricted Eulerian circuits in directed graphs
نویسندگان
چکیده
منابع مشابه
On Making Directed Graphs Eulerian
A directed graph is called Eulerian, if it contains a tour that traverses every arc in the graph exactly once. We study the problem of Eulerian Extension (EE) where a directed multigraph G and a weight function is given and it is asked whether G can be made Eulerian by adding arcs whose total weight does not exceed a given threshold. This problem is motivated through applications in vehicle rou...
متن کاملPacking Odd Circuits in Eulerian Graphs
Let C be the clutter of odd circuits of a signed graph ðG;SÞ: For nonnegative integral edge-weights w; we are interested in the linear program minðwtx: xðCÞ51; for C 2 C; and x50Þ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem, which is NP-hard. Guenin proved that (P) has an optimal solution that is integral so long as ðG;SÞ ...
متن کاملHamilton Circuits in Graphs and Directed Graphs
Let h be an arbitrary n-cycle in S n . Assume h ' is another n-cycle in S n . Then if σ = (h) 1 − h ' , σ is an element of A n , the alternating group of S n . From elementary group theory, every element of S n can be written as a product of (not necessarily disjoint) 3-cycles. Thus, h ' = hσ 1σ 2 ...σ r where each σ i (i = 1,2,...,r) is a 3-cycle. Defining h i = hσ 1σ 2 ...σ i , we now stipula...
متن کاملMulti-Eulerian Tours of Directed Graphs
Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times whenever tail(e) = tail(f). This definition leads to a simple generalization of the BEST Theorem. We then show that the minimal length of a multi-Eulerian tour is b...
متن کاملPolytopes associated with length restricted directed circuits
D = (V, A) mit Bo-gengewichten c a ∈ R, a ∈ A, einen gerichteten Kreis C einer zulässigen Länge |C| ∈ L mit minimalem Gewicht a∈C c a zu bestimmen. Dabei ist L die Menge der zulässigen Kreislängen. Das zugehörige Polytop ist das Polytop P L C (D) der längenbeschränkten gerichteten Kreise C in einem Digraphen D, das ist die konvexe Hülle der Inzidenzvek-toren der gerichteten Kreise C, die eine z...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1978
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-39-1-185-188